Fibrations and Hasse diagrams for 6d SCFTs
نویسندگان
چکیده
We study the full moduli space of vacua 6d worldvolume SCFTs on M5 branes probing an $A$-type singularity, focusing geometric incarnation discrete gauging mechanism which acts as a quotient Higgs branch fibered over tensor branch. combine insights from brane constructions and magnetic quiver techniques, in is implemented through concept decoration introduced [arXiv:2202.01218]. discover characterize new transverse slices between phases SCFTs, identifying some them with family isolated symplectic singularities recently discovered [arXiv:2112.15494], conjecturing existence two singularities.
منابع مشابه
Confluent Hasse Diagrams
We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with O(n2) features, in an O(n)×O(n) grid in O(n2) time. For the digraphs representing series-parallel partial orders we show how to construct a drawing with O(n) features in an O(n)×O(n) grid i...
متن کاملSynthesizing Petri Nets from Hasse Diagrams
Synthesis aims at producing a process model from specified sample executions. A user can specify a set of executions of a system in a specification language that is much simpler than a process modeling language. The intended process model is then constructed automatically. Synthesis algorithms have been extensively explored for cases where the specification language is a reachability graph or a...
متن کاملFolded Hasse diagrams of combined traces
To represent concurrent behaviours one can use concepts originating from language theory, including traces and comtraces. Traces can express notions such as concurrency and causality, whereas comtraces can also capture weak causality and simultaneity. This paper is concerned with the development of efficient data structures and algorithms for manipulating comtraces. We introduce and investigate...
متن کاملBorder Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice.
متن کاملWeakly transitive orientations, Hasse diagrams and string graphs
Middendorf, M. and F. Pfeiffer, Weakly transitive orientations, Hasse diagrams and string graphs, Discrete Mathematics 111 (1993) 393-400. We introduce the notion of a weakly transitive orientation for graphs as a natural generalization of transitive orientations and give a characterization for weakly transitive orientations in terms of forbidden substructurs. As a corollary of this characteriz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2022
ISSN: ['1127-2236', '1126-6708', '1029-8479']
DOI: https://doi.org/10.1007/jhep12(2022)159